PQ axiverse

نویسندگان

چکیده

A bstract We show that the strong CP problem is solved in a large class of compactifications string theory. The Peccei-Quinn mechanism solves if CP-breaking effects ultraviolet completion gravity and QCD are small compared to CP-preserving axion potential generated by low-energy instantons. characterize both classes effects. To understand quantum gravitational effects, we consider an ensemble flux type IIB theory on orientifolds Calabi-Yau hypersurfaces geometric regime, taking simple model D7-branes. D-brane instanton contribution neutron electric dipole moment falls exponentially N 4 , with number axions. In particular, this negligible all models our > 17. interpret result as consequence geometry create hierarchies actions also suppress cutoff. compute breaking due high-energy instantons QCD. absence vectorlike pairs, find contributions not excluded, but could be accessible future experiments scale supersymmetry sufficiently low. existence pairs can lead larger moment. Finally, significant fraction allowed standard cosmological astrophysical constraints.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

String Axiverse

String theory suggests the simultaneous presence of many ultralight axions, possibly populating each decade of mass down to the Hubble scale 10−33eV. Conversely the presence of such a plenitude of axions (an “axiverse”) would be evidence for string theory, since it arises due to the topological complexity of the extra-dimensional manifold and is ad hoc in a theory with just the four familiar di...

متن کامل

Factoring N = pq

We discuss the problem of factoring N = pq and survey some approaches. We then present a specialized factoring algorithm that runs in time Õ(q0.31), which is comparable to the runtime Õ(p) of the factoring algorithm for integers of the form N = pq presented in [1]. We then survey the factoring algorithm of [1] and discuss the number of advice bits needed for it to run in polynomial time. Furthe...

متن کامل

Planarity Algorithms via PQ-Trees

We give a linear-time planarity test that unifies and simplifies the algorithms of Shih and Hsu and Boyer and Myrvold; in our view, these algorithms are really one algorithm with different implementations. This leads to a short and direct proof of correctness without the use of Kuratowski’s theorem. Our planarity test extends to give a uniform random embedding, to count embeddings, to represent...

متن کامل

Computing Surfaces via pq-Permutations

In algebraic topology, compact 2-dimensional manifolds are usually dealt through a well-defined class of words denoting polygonal presentations. In this paper, we show how to eliminate the useless bureaucracy intrinsic to word-based presentations by considering very simple combinatorial structures called pq-permutations. Thanks to their effectiveness, pq-permutations allow to define a rewriting...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of High Energy Physics

سال: 2023

ISSN: ['1127-2236', '1126-6708', '1029-8479']

DOI: https://doi.org/10.1007/jhep06(2023)092